/**
 * Copyright (c) 2019, ShangHai YTO Co., Ltd.
 * All right reserved.
 *
 * THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF YTO
 * CO., LTD.  THE CONTENTS OF THIS FILE MAY NOT BE DISCLOSED
 * TO THIRD PARTIES, COPIED OR DUPLICATED IN ANY FORM, IN WHOLE OR IN PART,
 * WITHOUT THE PRIOR WRITTEN PERMISSION OF YTO
 * CO., LTD.
 */
package org.sc.xl.algorithm;

/**
 * @description: TODO 请在此添加描述
 * @reason: TODO ADD REASON(可选)
 * @author FXL
 *
 * @date 2023/10/9 15:08 
 * @since JDK 1.8
 */
public class MergeSortTest {


    public static void merge(int[] array, int left, int right) {
        if (left < right) {
            int mid = (left + right) / 2;
            merge(array, left, mid);
            merge(array, mid + 1, right);

        }
    }

    public static void main(String[] args) {
        int[] array = {19, 27, 46, 48, 50, 2, 4, 44, 47, 36, 38, 15, 26, 5, 3};

    }
}